On the Approximability of Minimum Topic Connected Overlay and Its Special Instances
نویسندگان
چکیده
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) has been investigated: Given a set of t topics, collection of n users together with the lists of topics they are interested in, the aim is to connect these users to a network by a minimum number of edges such that every graph induced by users interested in a common topic is connected. It is known that MinTCO is NP-hard and approximable within O(log t) in polynomial time. In this paper, we further investigate the problem and some of its special instances. We give various hardness results for instances where the number of users interested in a common topic is constant, and also for the instances where the number of topics in which an user is interested in is bounded by a constant. Furthermore, we close the gap of hardness of Min-TCO by showing its LOGAPX -completeness. We also present a few polynomial-time algorithms for very restricted instances of Min-TCO.
منابع مشابه
On the approximability and hardness of minimum topic connected overlay and its special instances
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) has been investigated: Given a set of t topics and a collection of n users together with the lists of topics they are interested in, the aim is to connect these users to a network by a minimum number of edges such that ...
متن کاملOn the Approximation of Special Instances of Minimum Topic-Connected Overlay
The design of a scalable overlay network to support decentralized topic-based publish/subscribe communication is nowadays a problem of great importance. We investigate here one such design problem called Minimum Topic-Connected Overlay. Given a collection of users together with the lists of topics they are interested in, connect these users to a network by a minimum number of edges such that ev...
متن کاملOn Approximation Hardness of the Minimum 2SAT-DELETION Problem
The Minimum 2SAT-Deletion problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems [8], and its approximability is largely open. We prove a lower approximation bound of 8 √ 5 − 15 ≈ 2.88854, improving the previous bound of 10 √ 5 − 21 ≈ 1.36067 by Dinur and Safra [5]. For h...
متن کاملApproximability of the Minimum Bisection Problem: An Algorithmic Challenge
We survey some recent results on the complexity of computing approximate solutions for instances of the Minimum Bisection problem and formulate some very intriguing and still open questions about the approximability status of that problem.
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کامل